Parallel Evaluation of Hierarchical Image Databases

نویسندگان

  • Ulrich Büker
  • Bärbel Mertsching
چکیده

This paper presents a hierarchical image transformation and efficient parallel algorithms for its evaluation. This transformation maps image structures onto code trees of different height, depending on the size of the structure. Thereby, important structures are effectively separated from the background. The inherent parallelism of such a hierarchical image transformation is outlined. The algorithms are domain independent and were successfully used for workpiece recognition and for traffic sign detection. A communication module for farmer-worker applications that supports specialized processors, like frame grabbers or display units, as well as the parallel recognition process are illustrated in detail. The implementation is done on a

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Leaf Recognition from a Big Hierarchical Image Database

Automatic plant recognition has become a research focus and received more and more attentions recently. However, existing methods usually only focused on leaf recognition from small databases that usually only contain no more than hundreds of species, and none of them reported a stable performance in either recognition accuracy or recognition speed when compared with a big image database. In th...

متن کامل

A Novel Multiscale Fractal Image Coding Algorithm based on SIMD Parallel Hardware

Progressive coding techniques are becoming more and more important as they enable quick browsing of large image databases. Fractal image compression is not intrinsically suitable for hierarchical schemes, but the proposed algorithm yields interesting results thanks to a set of new features. The main novelties are the introduction of a residual coding approach, the use of a quadtree decompositio...

متن کامل

ROCKET: A Robust Parallel Algorithm for Clustering Large-Scale Transaction Databases

We propose a robust and efficient algorithm called ROCKET for clustering large-scale transaction databases. ROCKET is a divisive hierarchical algorithm that makes the most of recent hardware architecture. ROCKET handles the cases with the small and the large number of similar transaction pairs separately and efficiently. Through experiments, we show that ROCKET achieves high-quality clustering ...

متن کامل

A hierarchical Convolutional Neural Network for Segmentation of Stroke Lesion in 3D Brain MRI

Introduction: Brain tumors such as glioma are among the most aggressive lesions, which result in a very short life expectancy in patients. Image segmentation is highly essential in medical image analysis with applications, particularly in clinical practices to treat brain tumors. Accurate segmentation of magnetic resonance data is crucial for diagnostic purposes, planning surgical treatments, a...

متن کامل

A hierarchical Convolutional Neural Network for Segmentation of Stroke Lesion in 3D Brain MRI

Introduction: Brain tumors such as glioma are among the most aggressive lesions, which result in a very short life expectancy in patients. Image segmentation is highly essential in medical image analysis with applications, particularly in clinical practices to treat brain tumors. Accurate segmentation of magnetic resonance data is crucial for diagnostic purposes, planning surgical treatments, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 31  شماره 

صفحات  -

تاریخ انتشار 1995